A linear time erasure-resilient code with nearly optimal recovery
نویسندگان
چکیده
منابع مشابه
A linear time erasure-resilient code with nearly optimal recovery
We develop an efficient scheme that produces an encoding of a given message such that the message can be decoded from any portion of the encoding that is approximately equal to the length of the message. More precisely, an (n, c, `, r)-erasure-resilient code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of `-bit p...
متن کاملLinear Time Erasure Codes With Nearly Optimal Recovery
An (n; c; `; r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of`-bit packets of total length cn from an n-bit message. The decoding algorithm is able to recover the message from any set of packets whose total length is r, i.e., from any set of r=`packets. We describe erasure codes where both the enco...
متن کاملLinear Time Erasure Codes with Nearly Optimal Recovery (Extended Abstract)
An (n, c, `, r)-erasure code consists of an encoding algorithm and a decoding algorithm with the following properties. The encoding algorithm produces a set of `-bit packets of total length cn from an n-bit message. The decoding algorithm is able to recover the message from any set of packets whose total length is r, i.e., from any set of r/` packets. We describe erasure codes where both the en...
متن کاملLinear Time Probabilistic Erasure Codes With Nearly Optimal Recovery
We present a linear time probabilistic erasure code with the following properties. The encoding algorithm produces cn letters from an n letter message. The decoding algorithm is able with high probability to reconstruct the message from any set of (1+ ǫ)n letters. Alon and Luby [5, 6] simultaneously developed a deterministic version but their running time is O(ǫ−4n) instead of our O(ǫ−1 ln(ǫ)n)...
متن کاملAsymptotically optimal erasure-resilient codes for large disk arrays
Reliability is a major concern in the design of large disk arrays. Hellerstein et al. pioneered the study of erasure-resilient codes that allow one to reconstruct the original data even in the presence of disk failures. In this paper, we take a set systems view of the problem of constructing erasure-resilient codes. This leads to interesting extremal problems in nite set theory. Solutions to so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1996
ISSN: 0018-9448
DOI: 10.1109/18.556669